A Little Blocked Literal Goes a Long Way
نویسندگان
چکیده
Q-resolution is a generalization of propositional resolution that provides the theoretical foundation for search-based solvers of quantified Boolean formulas (QBFs). Recently, it has been shown that an extension of Q-resolution, called long-distance resolution, is remarkably powerful both in theory and in practice. However, it was unknown how long-distance resolution is related to QRAT, a proof system introduced for certifying the correctness of QBF-preprocessing techniques. We show that QRAT polynomially simulates long-distance resolution. Two simple rules of QRAT are crucial for our simulation—blocked-literal addition and blocked-literal elimination. Based on the simulation, we implemented a tool that transforms long-distance-resolution proofs into QRAT proofs. In a case study, we compare long-distance-resolution proofs of the wellknown Kleine Büning formulas with corresponding QRAT proofs.
منابع مشابه
Does a little bit really go a long way? Infection prevention in ambulatory healthcare facilities.
Does a little bit go a long way, as the old saying goes? The origin of the saying "A little bit goes a long way" is unclear. The relevance of the application of this old saying to various settings and situations is equally unclear. Similarly, the relevance to clinical medicine is totally "uncharted territory." In her 2001 hit song "A Little Bit," the pop singer Jessica Simpson sings that "a lit...
متن کاملBlocked Literals Are Universal
We recently introduced a new proof system for Quantified Boolean Formulas (QBF), called QRAT, that opened up a variety of new preprocessing techniques. This paper presents a concept that follows from the QRAT proof system: blocked literals. Blocked literals are redundant universal literals that can be removed or added to clauses. We show that blocked literal elimination (BLE) and blocked litera...
متن کاملFinding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model
We report a polynomial time SAT problem instance, the Blocked SAT problem. A blocked clause set, an instance of the Blocked SAT problem, contains only blocked clauses. A close is blocked (for resolution) if it has a literal on which no resolution is possible in the clause set. We know from work of O. Kullmann that a blocked clause can be added or deleted from a clause set without changing its s...
متن کاملCritique of "Distance Estimation with Night Vision Goggles: A Little Feedback Goes a Long Way"
The authors addressed a topic that has practical importance and that deserves further study. They raised interesting questions about distance estimates, and extended results obtained with unaided vision to performance with NVGs. In this critique, several issues were raised in an attempt to foster an informative scholarly exchange.
متن کامل